﻿#include <iostream>
#include "Solution.h"
#include "数组和字符串.h"
#include "图.h"
#include "矩阵.h"

using namespace std;

int main()
{
    Solution solution;
    vector<vector<int>> grid;
    grid.push_back({ -2147483646,-2147483645 });
    grid.push_back({ 2147483646, 2147483647 });
    //grid.push_back({ 2, 3 });
    //grid.push_back({ 1, 2 });
    int ans = solution.findMinArrowShots(grid);
    cout << ans << endl;


    //int data[20];
    //cout << "data size is " << sizeof(data) << endl;
    //Solution solution;
    //solution.minimumNumbers(58, 9);

    ////vector<int> nums1 = { 1, 2, 3, 0, 0, 0 };
    //vector<int> nums2 = { 2, 5, 6 };
    //solution.isPalindrome("A man, a plan, a canal: Panama");
    //for (int i = 0; i < nums1.size(); i++)
    //    cout << nums1[i] << " ";
    //solution.minWindow("ADOBECODEBANC", "ABC");

    //cout << solution.superEggDrop(3, 14);

    //vector<int> nums1 = { 6,4,2,0,3,2,0,3,1,4,5,3,2,7,5,3,0,1,2,1,3,4,6,8,1,3 };
    //vector<vector<char>> grid;
    //grid.push_back({ 'O','X','X','O','X'});
    //grid.push_back({ 'X','O','O','X','O' });
    //grid.push_back({ 'X','O','X','X','X' });
    //grid.push_back({ 'O','X','X','O','X' });
    //grid.push_back({ 'O','X','X','O','X' });
    //Node* node1 = new Node(1);
    //Node* node2 = new Node(2);
    //Node* node3 = new Node(3);
    //Node* node4 = new Node(4);
    //node1->neighbors.push_back(node2);
    //node1->neighbors.push_back(node4);
    //node2->neighbors.push_back(node1);
    //node2->neighbors.push_back(node3);
    //node3->neighbors.push_back(node2);
    //node3->neighbors.push_back(node4);
    //node4->neighbors.push_back(node1);
    //node4->neighbors.push_back(node3);
    //图 test;
    //Node* node = test.cloneGraph(node1);

    //数组和字符串 strs;
    //strs.strStr("sadbutsad", "sad");
}
